Understanding Branch Cuts of Expressions

نویسندگان

  • Matthew England
  • Russell J. Bradford
  • James H. Davenport
  • David J. Wilson
چکیده

We assume some standard choices for the branch cuts of a group of functions and consider the problem of then calculating the branch cuts of expressions involving those functions. Typical examples include the addition formulae for inverse trigonometric functions. Understanding these cuts is essential for working with the single-valued counterparts, the common approach to encoding multi-valued functions in computer algebra systems. While the de ning choices are usually simple (typically portions of either the real or imaginary axes) the cuts induced by the expression may be surprisingly complicated. We have made explicit and implemented techniques for calculating the cuts in the computer algebra programme Maple. We discuss the issues raised, classifying the di erent cuts produced. The techniques have been gathered in the BranchCuts package, along with tools for visualising the cuts. The package is included in Maple 17 as part of the FunctionAdvisor tool.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cognitive Therapy Protocol of Understanding Embodiment Metaphorical Expressions in Children with William’s Syndrome

Background: Normal children understand and use embodiment metaphorical expressions since they start learning a language, but children suffering from William’s syndrome even in adulthood have little understanding of such expressions and they can hardly use them. Objectives: This study is an attempt to teach embodiment metaphorical expressions of 4.5-5 year old Persian children suffering...

متن کامل

On the relative strength of different generalizations of split cuts

Split cuts are among the most important and well-understood cuts for general mixed-integer programs. In this paper we consider some recent generalizations of split cuts and compare their relative strength. More precisely, we compare the elementary closures of split, cross, crooked cross and general multi-branch split cuts as well as cuts obtained from multi-row and basic relaxations. We present...

متن کامل

Foundation-penalty cuts for mixed-integer programs

We propose a new class of Foundation-Penalty (FP) cuts for GUB-constrained (and ordinary) mixed-integer programs, which are easy to generate by exploiting standard penalty calculations that are routinely employed in branch-and-bound contexts. The FP cuts are derived with reference to a selected integer variable or GUB set, and a foundation function that is typically a reduced cost function corr...

متن کامل

A class of multi-level balanced Foundation-Penalty cuts for mixed-integer programs

Glover and Sherali (2003) introduced a wide class of Foundation-Penalty (FP) cuts for GUB and ordinary mixed-integer programs. The FP cuts are easy to generate by exploiting routine branch-and-bound penalty calculations, and encompass other classical cuts such as disjunctive cuts, lift-and-project cuts, convexity cuts, Gomory cuts, and mixed-integer rounding cuts. Here we focus on two special c...

متن کامل

Computational Experiments with Cross and Crooked Cross Cuts

In a recent paper, Dash, Dey and Günlük (2010) showed that many families of inequalities for the two-row continuous group relaxation and variants of this relaxation are cross cuts or crooked cross cuts, both of which generalize split cuts. Li and Richard (2008) recently studied t-branch split cuts for mixedinteger programs for integers t ≥ 1. Split cuts are just 1-branch split cuts, and cross c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013